Higher Geometry for Non-geometric T-Duals
نویسندگان
چکیده
منابع مشابه
A Geometry for Non-Geometric String Backgrounds
A geometric string solution has background fields in overlapping coordinate patches related by diffeomorphisms and gauge transformations, while for a non-geometric background this is generalised to allow transition functions involving duality transformations. Non-geometric string backgrounds arise from T-duals and mirrors of flux compactifications, from reductions with duality twists and from a...
متن کاملSpherical T-duality II: An infinity of spherical T-duals for non-principal SU(2)-bundles
Recently we initiated the study of spherical T-duality for spacetimes that are principal SU(2)-bundles [5]. In this paper, we extend spherical T-duality to spacetimes that are oriented non-principal SU(2)-bundles. There are several interesting new examples in this case and a new phenomenon appearing in the non-principal case is the existence of infinitely many spherical T-duals.
متن کاملDuals for classical inventory models via generalized geometric programming
Inventory problems generally have a structure that can be exploited for computational purposes. Here, we look at the duals of two seemingly unrelated inventory models that suggest an interesting duality between discrete time optimal control and optimization over an ordered sequence of variables. Concepts from conjugate duality and generalized geometric programming are used to establish the dual...
متن کاملGeometric Construction of Coordinates for Convex Polyhedra using Polar Duals
A fundamental problem in geometry processing is that of expressing a point inside a convex polyhedron as a combination of the vertices of the polyhedron. Instances of this problem arise often in mesh parameterization and 3D deformation. A related problem is to express a vector lying in a convex cone as a non-negative combination of edge rays of this cone. This problem also arises in many applic...
متن کاملGeometry Freedom in Geometric Computation—Towards Higher-Order Genericity through Purely Combinatorial Geometric Algorithms
Any geometric algorithm can be dissected into combinatorial parts and geometric parts. The two parts intertwine in both the description and the implementation of the algorithm. We consider the benefits of relaxing this tight coupling. Coordinate freedom is widely considered the most important principle in designing and implementing geometric systems. By ensuring that client code not manipulate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Physics
سال: 2019
ISSN: 0010-3616,1432-0916
DOI: 10.1007/s00220-019-03496-3